Epsilon substitution method for elementary analysis
نویسندگان
چکیده
منابع مشابه
Epsilon–Substitution Method for the Ramified Language and ∆1-Comprehension Rule
We extend to Ramified Analysis the definition and termination proof of Hilbert’s substitution method. This forms a base for future extensions to predicatively reducible subsystems of analysis. First such system treated here is second order arithmetic with ∆1-comprehension rule. Introduction The epsilon substitution method is based on the language introduced by Hilbert [7]. The main non-boolean ...
متن کاملEpsilon substitution for transfinite induction
We apply Mints’ technique for proving the termination of the epsilon substitution method via cut-elimination to the system of Peano Arithmetic with Transfinite Induction given by Arai.
متن کاملHilbert’s “Verunglückter Beweis”, the first epsilon theorem, and consisteny proofs’, History and Philosophy of Logic 25:79–94
In the 1920s, Ackermann and von Neumann, in pursuit of Hilbert’s Programme, were working on consistency proofs for arithmetical systems. One proposed method of giving such proofs is Hilbert’s epsilon-substitution method. There was, however, a second approach which was not reflected in the publications of the Hilbert school in the 1920s, and which is a direct precursor of Hilbert’s first epsilon...
متن کاملSimple Construction of a Frame which is $epsilon$-nearly Parseval and $epsilon$-nearly Unit Norm
In this paper, we will provide a simple method for starting with a given finite frame for an $n$-dimensional Hilbert space $mathcal{H}_n$ with nonzero elements and producing a frame which is $epsilon$-nearly Parseval and $epsilon$-nearly unit norm. Also, the concept of the $epsilon$-nearly equal frame operators for two given frames is presented. Moreover, we characterize all bounded invertible ...
متن کاملEpsilon Substitution for ID1
Hilbert’s epsilon substitution method provides a technique for showing that a theory is consistent by producing progressively more accurate computable approximations to the non-computable components of a proof. If it can be shown that this process eventually halts with a sufficiently good approximation, the theory is consistent. Here we produce a new formulation of the method for the theory ID1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Arch. Math. Log.
دوره 35 شماره
صفحات -
تاریخ انتشار 1996